<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    530. Minimum Absolute Difference in BST
   </h1>
   <p>
    Given a binary search tree with non-negative values, find the minimum
    <a href="https://en.wikipedia.org/wiki/Absolute_difference">
     absolute difference
    </a>
    between values of any two nodes.
   </p>
   <p>
    <b>
     Example:
    </b>
   </p>
   <pre>
<b>Input:</b>

   1
    \
     3
    /
   2

<b>Output:</b>
1

<b>Explanation:</b>
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Note:
    </b>
    There are at least two nodes in this BST.
   </p>
  </div>
  <div>
   <h1 class="question_title">
    530. 二叉搜索树的最小绝对差
   </h1>
   <p>
    给定一个所有节点为非负值的二叉搜索树，求树中任意两节点的差的绝对值的最小值。
   </p>
   <p>
    <strong>
     示例 :
    </strong>
   </p>
   <pre>
<strong>输入:</strong>

   1
    \
     3
    /
   2

<strong>输出:</strong>
1

<strong>解释:
</strong>最小绝对差为1，其中 2 和 1 的差的绝对值为 1（或者 2 和 3）。
</pre>
   <p>
    <strong>
     注意:
    </strong>
    树中至少有2个节点。
   </p>
  </div>
 </body>
</html>